The $k$-dimensional distribution of combined GFSR sequences
نویسندگان
چکیده
منابع مشابه
Designing Asymptotically Random GFSR Sequences
Tootill et al. proposed the concept of an asymptotically random Tausworthe sequence, and gave an example of such sequence found by chance. However, no systematic way of nding such sequences has been proposed by now. In this paper we will give an algorithm for designing GFSR sequences which satisfy the asymptotic randomness approximately. Our algorithm is based on repeated applications of the al...
متن کاملON THE DISTRIBUTION OF fc-DIMENSIONAL VECTORS FOR SIMPLE AND COMBINED TAUSWORTHE SEQUENCES
The lattice structure of conventional linear congruential random number generators (LCGs), over integers, is well known. In this paper, we study LCGs in the field of formal Laurent series, with coefficients in the Galois field F2 . The state of the generator (a Laurent series) evolves according to a linear recursion and can be mapped to a number between 0 and 1, producing what we call a LS2 seq...
متن کاملPeriodicity and Distribution Properties of Combined FCSR Sequences
This is a study of some of the elementary statistical properties of the bitwise exclusive or of two maximum period feedback with carry shift register sequences. We obtain condition under which the resulting sequences has the maximum possible period, and we obtain bounds on the variation in the distribution of blocks of a fixed length. This may lead to improved design of stream ciphers using FCS...
متن کاملMaximally Equidistributed Decimated GFSR Generators
This paper presents generators based on decimated sequences of Generalized Feedback Shift Register (GFSR) generators. The equivalence relation between decimated GFSR generators and Tausworthe generators are presented and a k-distributed initialization scheme is derived. We present decimated GFSR generators that are maximally equidistributed. Timing results of these generators are presented.
متن کاملEstimating phylogenetic distances between genomic sequences based on the length distribution of k-mismatch common substrings
Various approaches to alignment-free sequence comparison are based on the length of exact or inexact word matches between two input sequences. Haubold et al. (2009) showed how the average number of substitutions between two DNA sequences can be estimated based on the average length of exact common substrings. In this paper, we study the length distribution of k-mismatch common substrings betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1994
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1994-1223233-9